Some Constructions and Embeddings of the Tilde Geometry

نویسندگان

  • Antonio Pasini
  • Hendrik Van Maldeghem
  • A. Pasini
  • H. Van Maldeghem
چکیده

Some old and new constructions of the tilde geometry (the flag transitive connected triple cover of the unique generalized quadrangle W(2) of order (2, 2)) are discussed. Using them, we prove some properties of that geometry. In particular, we compute its generating rank, we give an explicit description of its universal projective embedding and we determine its homogeneous embeddings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Constructions of Small Generalized Polygons

We present several new constructions for small generalized polygons using small projective planes together with a conic or a unital, using other small polygons, and using certain graphs such as the Coxeter graph and the Pappus graph. We also give a new construction of the tilde geometry using the Petersen graph. 2001 Academic Press

متن کامل

Algebraic Properties of Intuitionistic Fuzzy Residuated Lattices

In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...

متن کامل

A note on $lambda$-Aluthge transforms of operators

Let $A=U|A|$ be the polar decomposition of an operator $A$ on a Hilbert space $mathscr{H}$ and $lambdain(0,1)$. The $lambda$-Aluthge transform of $A$ is defined by $tilde{A}_lambda:=|A|^lambda U|A|^{1-lambda}$. In this paper we show that emph{i}) when $mathscr{N}(|A|)=0$, $A$ is self-adjoint if and only if so is $tilde{A}_lambda$ for some $lambdaneq{1over2}$. Also $A$ is self adjoint if and onl...

متن کامل

Extended to multi-tilde-bar regular expressions and efficient finite automata constructions

Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton and Yamada, is based on the computation of the Null, First, Last and Follow sets (called Glushkov functions) associated with a linearized version of the expression. Recently Mignot considered a family of extended expr...

متن کامل

On three families of extended tilde geometries

Let Γ be an extended tilde geometry of rank n > 2 such that there exists a 1-covering γ : Γ → Φ where Φ is a c.Cn−1-geometry with orders 1, 2, . . . , 2. Suppose that the normalizer in Aut(Γ ) of the deck group of γ acts flag-transitively on Γ . We prove that, under these hypotheses, only three possibilities exist for the universal cover of Γ . c © 2007 Elsevier Ltd. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001